Geometric Ergodicity of the Random Walk Metropolis with Position-Dependent Proposal Covariance

نویسندگان

چکیده

We consider a Metropolis–Hastings method with proposal N(x,hG(x)?1), where x is the current state, and study its ergodicity properties. show that suitable choices of G(x) can change these properties compared to Random Walk Metropolis case N(x,h?), either for better or worse. find if variance allowed grow unboundedly in tails distribution then geometric be established when target algorithm has are heavier than exponential, contrast case, but growth rate must carefully controlled prevent rejection approaching unity. also illustrate judicious choice result geometrically ergodic chain probability concentrates on an ever narrower ridge tails, something again not true Metropolis.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Variable Transformation to Obtain Geometric Ergodicity in the Random-walk Metropolis Algorithm

A random-walk Metropolis sampler is geometrically ergodic if its equilibrium density is super-exponentially light and satisfies a curvature condition (Jarner and Hansen, 2000). Many applications, including Bayesian analysis with conjugate priors of logistic and Poisson regression and of log-linear models for categorical data result in posterior distributions that are not super-exponentially lig...

متن کامل

On the Geometric Ergodicity of Metropolis-Hastings Algorithms

Abstract Under a compactness assumption, we show that a φ-irreducible and aperiodic MetropolisHastings chain is geometrically ergodic if and only if its rejection probability is bounded away from unity. In the particular case of the Independence Metropolis-Hastings algorithm, we obtain that the whole spectrum of the induced operator is contained in (and in many cases equal to) the essential ran...

متن کامل

Grapham: Graphical models with adaptive random walk Metropolis algorithms

Recently developed adaptive Markov chain Monte Carlo (MCMC) methods have been applied successfully to many problems in Bayesian statistics. Grapham is a new open source implementation covering several such methods, with emphasis on graphical models for directed acyclic graphs. The implemented algorithms include the seminal Adaptive Metropolis algorithm adjusting the proposal covariance accordin...

متن کامل

On the efficiency of pseudo-marginal random walk Metropolis algorithms

We examine the behaviour of the pseudo-marginal random walk Metropolis algorithm, where evaluations of the target density for the accept/reject probability are estimated rather than computed precisely. Under relatively general conditions on the target distribution, we obtain limiting formulae for the acceptance rate and for the expected squared jump distance, as the dimension of the target appr...

متن کامل

Random walk with jumps in large-scale random geometric graphs

0140-3664/$ see front matter 2010 Elsevier B.V. A doi:10.1016/j.comcom.2010.01.026 q This work has been supported in part by the proje Architecture) (IST-27489), the PENED 2003 program Research and Technology (GSRT) co-financed by the and by National Sources (25%) and the NoE CONTENT * Corresponding author. Address: National and Kapo Department of Informatics and Telecommunications, I Tel.: +30...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics

سال: 2021

ISSN: ['2227-7390']

DOI: https://doi.org/10.3390/math9040341